Fast computation of moving average and related filters in octagonal windows
نویسندگان
چکیده
A method is proposed for e ciently computing moving average lters in regular octagonal windows, as approximations to circular windows. The algorithm requires thirteen operations per pixel irrespective of window size and is faster than existing Fourier-based and recursive methods for all but the smallest windows. Further, new variance-weighted nonlinear lters are introduced, based on moving average lters. They are shown to smooth speckly images more e ectively than existing lters.
منابع مشابه
A Fast and Accurate Fundamental Frequency Estimator Using Recursive Moving Average Filters
We propose a fundamental frequency (F0) estimation method which is fast, accurate and suitable for real-time use. While the proposed method is based on the same framework as DIO [1, 2], it has two clear differences: it uses RMA (Recursive Moving Average) filters for attenuating high order harmonics, and the period detector is designed to work well even for signals which contain some higher harm...
متن کاملMoving average algorithms for diamond, hexagon, and general polygonal shaped window operations
This paper presents fast moving window algorithms for calculating local statistics in a diamond, hexagon, and general polygonal shaped windows of an image which is important for real-time applications. The algorithms for a diamond shaped window requires only seven or eight additions and subtractions per pixel. A fast sparse algorithm only needs four additions and subtractions for a sparse diamo...
متن کاملDiamond, Hexagon, and General Polygonal Shaped Window Smoothing
This paper presents fast recursive or moving windows algorithms for calculating local means in a diamond, hexagon and general polygonal shaped windows of an image. The algorithms for diamond shaped window require only seven or eight additions and subtractions per pixel. A number of other shapes of diamond windows such as skewed or parallelogram shaped diamond, long diamond, and lozenged diamond...
متن کاملFast least-squares polynomial approximation in moving time windows
Only a few time series methods are applicable to signal trend analysis under real-time conditions. The use of orthogonal polynomials for least-squares approximations on discrete data turned out to be very e cient for providing estimators in the time domain. A polynomial extrapolation considering signal trends in a certain time window is obtainable even for high sampling rates. The presented met...
متن کاملFast disparity estimation algorithm for mesh-based stereo image/video compression with two-stage hybrid approach
Disparity estimation is a very important operation in stereo image and video compression. However, existing disparity estimation algorithms require too large computation power. In this paper, we propose a fast disparity estimation algorithm for mesh-based stereo image and video compression with two-stage hybrid approach, which is names as Two Stage Iterative Block and Octagonal Matching algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 18 شماره
صفحات -
تاریخ انتشار 1997